Alternating plane graphs
نویسندگان
چکیده
منابع مشابه
Alternating Graphs
In this paper we generalize the concept of alternating knots to alternating graphs and show that every abstract graph has a spatial embedding that is alternating. We also prove that every spatial graph is a subgraph of an alternating graph. We define n-composition for spatial graphs and generalize the results of Menasco on alternating knots to show that an alternating graph is n-composite for n...
متن کاملA Cutting-Plane Alternating Projections Algorithm A Cutting-Plane, Alternating Projections Algorithm for Conic Optimization Problems
We introduce a hybrid projection-localization method for solving large convex cone programs. The method interleaves a series of projections onto localization sets with the classical alternating projections method for convex feasibility problems; the problem is made amenable to the method by reducing it to a convex feasibility problem composed of a subspace and a cone via its homogeneous self-du...
متن کاملUni-directional Alternating Group Graphs
A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable. The analysis of the shortest distance between any pair of nodes in a graph of this class is also given. Based on the analysis, we develop a polynomial time routing algorithm which yields a path distance at most one ...
متن کاملAlternating Sign Matrices and Descending Plane Partitions
An alternating sign matrix is a square matrix such that (i) all entries are 1,-1, or 0, (ii) every row and column has sum 1, and (iii) in every row and column the nonzero entries alternate in sign. Striking numerical evidence of a connection between these matrices and the descending plane partitions introduced by Andrews (Invent. Math. 53 (1979), 193-225) have been discovered, but attempts to p...
متن کاملAlternating cycles in soliton graphs
Soliton graphs having an alternating cycle are characterized with the help of a shrinking procedure. This characterization leads to a method testing the existence of an alternating cycle in a soliton graph. The suggested algorithm runs in O(n3) time, where n is the number of vertices in the graph. Key-Words: Combinatorial Problems, Graph Matchings, Alternating cycles, Soliton graphs, 1-extendab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2015
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.584.09a